The Noncooperative Transportation Problem
نویسندگان
چکیده
We extend the classical transportation problem from linear optimization and introduce several competing forwarders. This results in a noncooperative game which is commonly known as generalized Nash equilibrium problem. We show the existence of Nash equilibria and present numerical methods for their efficient computation. Furthermore, we discuss several equilibrium selection concepts that are applicable to this particular Nash game.
منابع مشابه
Game Theory and Transportation Systems Modelling
Abstract-In this paper, correspondences are drawn between two game theory models (Nash noncooperative and Stackelberg games) and some problems in transportation systems modelling. An example of each is described in detail, namely the problem of carriers competing for intercity passenger travel and the signal optimization problem. The discussion serves to underline differences between two catego...
متن کاملBounds on Benefits and Harms of Adding Connections to Noncooperative Networks
In computer networks (and, say, transportation networks), we can consider the situation where each user has its own routing decision so as to minimize noncooperatively the expected passage time of its packet/job given the routing decisions of other users. Intuitively, it is anticipated that adding connections to such a noncooperative network may bring benefits at least to some users. The Braess...
متن کاملFully Fuzzy Transportation Problem
Transportation problem is a linear programming which considers minimum cost for shipping a product from some origins to other destinations such as from factories to warehouse, or from a warehouse to supermarkets. To solve this problem simplex algorithmis utilized. In real projects costs and the value of supply and demands are fuzzy numbers and it is expected that optimal solutions for determini...
متن کاملAn Approximation Method for Fuzzy Fixed-Charge Transportation Problem
In this paper, we develop the fuzzy fixed charge transportation problem when the costs are the fuzzy numbers. The first step it transform into the classical fuzzy transportation problem. The next, we obtain the best approximation fuzzy on the optimal value of the fuzzy fixed-charge transportation problem. This method obtains a lower and upper bounds both on the fuzzy optimal value of the fuzzy ...
متن کاملConversion of Network Problem with Transfer Nodes, and Condition of Supplying the Demand of any Sink from the Particular Source to the Transportation Problem
In this article we present an algorithm for converting a network problem with several sources and several sinks including several transfer nodes and condition of supplying the demand of any sink from a particular source to the transportation problem. Towards this end, and considering the very special structure of transportation algorithm, after implementing the shortest path algorithm or ...
متن کامل